Engel Expansions of q-Series by Computer Algebra
نویسندگان
چکیده
The q-Engel Expansion is an algorithm that leads to unique series expansions of qseries. Various examples related to classical partition theorems, including the RogersRamanujan identities together with the elegant generalization found by Garrett, Ismail and Stanton, have been described recently. The object of this paper is to present the computer algebra package Engel, written in Mathematica, that has already played a significant rôle in this work. The package now is made freely available via the web and should help to intensify research in this new branch of q-series theory. Among various ∗Partially supported by National Science Foundation Grant DMS-9206993. †Partially supported by SFB grant F1305 of the Austrian FWF and by the Centre for Applicable Analysis and Number Theory of the University of Witwatersrand. ‡Supported by SFB grant F1305 of the Austrian FWF.
منابع مشابه
An Innnite Family of Engel Expansions of Rogers-ramanujan Type
The Extended Engel Expansion is an algorithm that leads to unique series expansions of q-series. Various examples related to classical partition theorems, including the RogersRamanujan identities, have been given recently. The object of this paper is to show that the new and elegant Rogers-Ramanujan generalization found by Garrett, Ismail, and Stanton also ts into this framework. This not only ...
متن کاملq–ENGEL SERIES EXPANSIONS AND SLATER’S IDENTITIES
We describe the q–Engel series expansion for Laurent series discovered by John Knopfmacher and use this algorithm to shed new light on partition identities related to two entries from Slater’s list. In our study Al-Salam/Ismail and Santos polynomials play a crucial rôle. Dedicated to the memory of John Knopfmacher 1937–1999
متن کاملAn In nite Family of Engel
The Extended Engel Expansion is an algorithm that leads to unique series expansions of q-series. Various examples related to classical partition theorems, including the Rogers-Ramanujan identities, have been given recently. The object of this paper is to show that the new and elegant Rogers-Ramanujan generalization found by Garrett, Ismail, and Stanton also ts into this framework. This not only...
متن کاملDually quasi-De Morgan Stone semi-Heyting algebras II. Regularity
This paper is the second of a two part series. In this Part, we prove, using the description of simples obtained in Part I, that the variety $mathbf{RDQDStSH_1}$ of regular dually quasi-De Morgan Stone semi-Heyting algebras of level 1 is the join of the variety generated by the twenty 3-element $mathbf{RDQDStSH_1}$-chains and the variety of dually quasi-De Morgan Boolean semi-Heyting algebras--...
متن کاملCalcul Symbolique, Programmation Et G Enie Logiciel General Asymptotic Scales and Computer Algebra General Asymptotic Scales and Computer Algebra General Asymptotic Scales and Computer Algebra
In many natural applications, one encounters asymptotic expansions of a form more complicated than mere Puiseux series. Existing computer algebra systems lack good algorithms for handling such asymptotic expansions. We present tools that permit the representation and automatic handling of general exp-log asymptotic expansions. Echelles Asymptotiques G en erales et Calcul Formel R esum e Dans de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000